Parallel FFT-Hashing
نویسندگان
چکیده
We propose two families of scalable hash functions for collision–resistant hashing that are highly parallel and based on the generalized fast Fourier transform (FFT). FFT–hashing is based on multipermutations. This is a basic cryptographic primitive for perfect generation of diffusion and confusion which generalizes the boxes of the classic FFT. The slower FFT–hash functions iterate a compression function. For the faster FFT–hash functions all rounds are alike with the same number of message words entering each round.
منابع مشابه
Preimage Attack on Parallel FFT-Hashing
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a multi-permutation which helps in proving its resistance to collision attacks. In this work we show a preimage attack on Parallel FFT-Hashing with complexity 2 + 2 and memory 2 which is less than the generic complexity ...
متن کاملPreimage Attacks On Provably Secure FFT Hashing proposed at Second Hash Workshop in 2006
‘Provably Secure FFT Hashing’ (We call FFT-Hash in this paper) was suggested by Lyubashevsky et al.. in Second Hash Workshop in Aug. 2006. This paper shows preimage attacks on hash functions based on three modes of FFT-Hash. In case of ‘Nano’ whose output size is 513 bits, we can find a preimage with complexity 2. In case of ‘Mini’ whose output size is 1025 bits, we can find a preimage with com...
متن کاملSWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique underlying our functions is a novel use of the Fast Fourier Transform (FFT) to achieve “diffusion,” together with a linear combination to achieve compression and “confusion.” We provide a detailed security analysis of conc...
متن کاملDistributed Linear Hashing and Parallel Projection in Main Memory Databases
This paper extends the concepts of the distributed linear hashed main memory file system with the objective of supporting higher level parallel dambase operations. The basic distributed linear hashing technique provides a high speed hash based dynamic file system on a NUMA atchitecture multi-processor system. Distributed linear hashing has been extended to include the ability to perform high sp...
متن کاملImage authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کامل